Homoclinic Orbits of a Quadratic Isochronous System by the Perturbation-incremental Method

In this paper, the perturbation-incremental method is presented for the analysis of a quadratic isochronous system. This method combines the remarkable characteristics of the perturbation method and the incremental method. The first step is the perturbation method. Assume that the parameter $\lambda$ is small, i.e. $\lambda\approx0$, the initial expression of the homoclinic orbit is obtained. The second step is the parameter incremental method. By extending the solution corresponding to small parameters to large parameters, we can get the analytical-expressions of homoclinic orbits.     

二次Lagrangian有限元方程的几何多重网格法

为了构造快速求解二次Lagrangian有限元方程的几何多重网格法,在选择二次Lagrangian有限元空间和一系列线性Lagrangian有限元空间分别作为最细网格层和其余粗网格层以及构造一种新限制算子的基础上,提出了一种新的几何多重网格法,并对它的计算量进行了估计.数值实验结果,与通常的几何多重网格法和AMG01法相比,表明了新算法计算量少且稳健性强.     

Optimal investment and risk control policies for an insurer: Expected utility maximization

Motivated by the AIG bailout case in the financial crisis of 2007–2008, we consider an insurer who wants to maximize his/her expected utility of terminal wealth by selecting optimal investment and risk control strategies. The insurer’s risk process is modeled by a jump-diffusion process and is negatively correlated with the capital gains in the financial market. We obtain explicit solutions of optimal strategies for various utility functions.     

New reformulations for probabilistically constrained quadratic programs

The mixed integer quadratic programming (MIQP) reformulation by Zheng, Sun, Li, and Cui (2012) for probabilistically constrained quadratic programs (PCQP) recently published in EJOR significantly dominates the standard MIQP formulation ( and ) which has been widely adopted in the literature. Stimulated by the dimensionality problem which Zheng et al. (2012) acknowledge themselves for their reformulations, we study further the characteristics of PCQP and develop new MIQP reformulations for PCQP with fewer variables and constraints. The results from numerical tests demonstrate that our reformulations clearly outperform the state-of-the-art MIQP in Zheng et al. (2012).     

Approximation of the Quadratic Set Covering problem

We study in this article the polynomial approximation properties of the Quadratic Set Covering problem. This problem, which arises in many applications, is a natural generalization of the usual Set Covering problem. We show that this problem is very hard to approximate in the general case, and even in classical subcases (when the size of each set or when the frequency of each element is bounded by a constant). Then we focus on the convex case and give both positive and negative approximation results. Finally, we tackle the unweighted version of this problem.     

Semi-invariants in surgery

A semi-invariant in surgery is an invariant of a quadratic Poincaré complex which is defined in terms of a null-cobordism. We define five such gadgets: the semicharacteristic, the semitorsion, the cross semitorsion, the torsion semicharacteristic, and the cross torsion semicharacteristic. We describe applications to the evaluation of surgery obstructions, especially in the odd-dimensional case.     

二次微分系统的中心条件和通积分

本文给出在中国分类之下二次微分系统有中心时两种情况的通积分.     

A class of methods for solving large,convex quadratic programs subject to box constraints

In this paper we analyze conjugate gradient-type algorithms for solving convex quadratic programs subject only to box constraints (i.e., lower and upper bounds on the variables). Programs of this type, which we denote by BQP, play an important role in many optimization models and algorithms. We propose a new class of finite algorithms based on a nonfinite heuristic for solving a large, sparse BQP. The numerical results suggest that these algorithms are competitive with Dembo and Tulowitzski's (1983) CRGP algorithm in general, and perform better than CRGP for problems that have a low percentage of free variables at optimality, and for problems with only nonnegativity constraints.     

一类具有二阶细焦点的二次系统

本文证明了一类具有二阶细焦点的二次系统（在其二阶细焦点外围）至多存在一个极限环．     

A generalization of the inertia theorem for quadratic matrix polynomials

We show that the inertia of a quadratic matrix polynomial is determined in terms of the inertia of its coefficient matrices if the leading coefficient is Hermitian and nonsingular, the constant term is Hermitian, and the real part of the coefficient matrix of the first degree term is definite. In particular, we prove that the number of zero eigenvalues of such a matrix polynomial is the same as the number of zero eigenvalues of its constant term. We also give some new results for the case where the real part of the coefficient matrix of the first degree term is semidefinite.